package com.stanley.alogrithm.sorts;

public class SortUtils {

    public static void swap(int[] array, int i, int j) {
        if (array == null || array.length <= 0 || i < 0 || i >= array.length || j < 0 || j >= array.length) {
            return;
        }
        int temp = array[i];
        array[i] = array[j];
        array[j] = temp;
    }
}
